Greedy Best-First Search for the Optimal-Size Sorting Network Problem
نویسندگان
چکیده
منابع مشابه
Adding Exploration to Greedy Best-First Search
While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause the algorithm to get stuck performing a lot of unnecessary work. In this report, we consider simple ...
متن کاملUnderstanding the Search Behaviour of Greedy Best-First Search
A classical result in optimal search shows that A* with an admissible and consistent heuristic expands every state whose f -value is below the optimal solution cost and no state whose f -value is above the optimal solution cost. For satisficing search algorithms, a similarly clear understanding is currently lacking. We examine the search behaviour of greedy bestfirst search (GBFS) in order to m...
متن کاملJasper: the Art of Exploration in Greedy Best First Search
LAMA-2011 (Richter and Westphal 2010) is the clear winner of the sequential satisficing track in the latest International Planning Competition (IPC-2011). It finds a first solution by Greedy Best-First Search (GBFS), and then continues to improve solutions using restarting weighted A* (Richter, Thayer, and Ruml 2010). Diverse Anytime Search (DAS) (Xie, Valenzano, and Müller 2013) is a metaalgor...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملExploration among and within Plateaus in Greedy Best-First Search
Recent enhancements to greedy best-first search (GBFS) such as DBFS, -GBFS, Type-GBFS improve performance by occasionally adopting a non-greedy node expansion policy, resulting in more exploratory behavior. However, previous exploratory mechanisms do not address exploration within the space sharing the same heuristic estimate (plateau). In this paper, we show these two modes of exploration, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2019
ISSN: 1877-0509
DOI: 10.1016/j.procs.2019.09.199